Longitudinal Motion Planning for Slung-Loads Using Simplified Models and Rapidly-Exploring Random Trees

نویسندگان

  • Eric N. Johnson
  • John G. Mooney
چکیده

A randomized motion-planning approach to providing guidance for helicopters with under-slung loads is presented. Rapidly-exploring Random Trees are adapted to plan trajectories for simplified helicopter-load models. Four different planning models are tested against four different representative tasks. The poor performance of the baseline planner, and subsequent efforts to improve that performance shows the sensitivity of the RRT to proper sizing of the sampling area and amount of computation available. Further lines of potential research into optimizing planner performance and reducing computational cost are identified.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robotic Path Planning using Rapidly exploring Random Trees

Rapidly exploring Random Tree (RRT) path planning methods provide feasible paths between a start and goal point in configuration spaces containing obstacles, sacrificing optimality (eg. Shortest path) for speed. The raw resultant paths are generally jagged and the cost of extending the tree can increase steeply as the number of existing branches grow. This paper provides details of a speed-up m...

متن کامل

Sampling-based Motion Planning for Cooperative Aerial Manipulation

This paper focuses on the optimal motion planning problem for cooperative aerial manipulation. We use the rapidly exploring random trees star (RRT*) algorithm that finds feasible paths quickly and optimizes them. For local planning within RRT*, we developed a trajectory planner using Bezier-curve which utilizes the differential flatness property of the aerial manipulator. Time-parameterization ...

متن کامل

RSRT: Rapidly exploring sorted random tree - online adapting rrt to reduce computational solving time while motion planning in wide configuration spaces

We present a new algorithm, named RSRT, for Rapidly-exploring Random Trees (RRT) based on inherent relations analysis between RRT components. RRT algorithms are designed to consider interactions between these inherent components. We explain properties of known variations and we present some future once which are required to deal with dynamic strategies. We present experimental results for a wid...

متن کامل

Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments

The sampling based motion planning algorithm known as Rapidly-exploring Random Trees (RRT) has gained the attention of many researchers due to their computational efficiency and effectiveness. Recently, a variant of RRT called RRT* has been proposed that ensures asymptotic optimality. Subsequently its bidirectional version has also been introduced in the literature known as Bidirectional-RRT* (...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015